(H 1, H 2)-supermagic labelings for some shackles of connected graphs H 1 and H 2

H-supermagic labelings of graphs

A simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic to H. The graph G is H−magic if there exists a bijection f : V (G) [ E(G) ! {1, 2, 3, · · · , |V (G) [ E(G)|} such that for every subgraph H0 P of G isomorphic to H. G is said to be H − supermagic if f(V (G)) = {1, 2, 3, · · · , |V (G)|}. In thi...

PREPARATION AND CHARACTERIZATION OF [Ni (MAP) ] ; H- MAP = 2- (METHYLAMINO) PYRIDINE H. Aghabozorg* and H. H. Monfared

We have recently synthesized [Ni (MAP) ] complex [H-MAP= 2- (methylamino) pyridine]. 2- (Methy1amino)pyridine reacts with MeLi in THF and generates the lithium salt (Li-MAP). Further reaction of NiCl with two equivalent of this ligand in THF leads to the formation of a dark red solution. Analytical data, molecular weight, and magnetic susceptibility of this complex confirm the formula [N...

Super (a, d)-H-antimagic total labelings for shackles of a connected graph H

A simple graph G = (V (G), E(G)) admits an H-covering, if every edge in E(G) belongs to at least one subgraph of G isomorphic to a given graph H. An (a, d)-H-antimagic total labeling of G admitting an H-covering is a bijective function ξ : V (G) ∪ E(G) → {1, 2, . . . , |V (G)| + |E(G)|} such that for all subgraphs H ′ isomorphic to H, the H-weights w(H ′) = ∑

H.1 H.2 H.3 H.4

H-supermagic labelings for firecrackers, banana trees and flowers

A simple graph G = (V,E) admits an H-covering if every edge in E is contained in a subgraph H ′ = (V , E) of G which is isomorphic to H . In this case we say that G is H-supermagic if there is a bijection f : V ∪ E → {1, . . . |V | + |E|} such that f(V ) = {1, . . . , |V |} and ∑ v∈V (H) f(v) + ∑ e∈E(H) f(e) is constant over all subgraphs H ′ of G which are isomorphic to H . In this paper, we s...